Posets of cohomological dimension one with finitely many tails
نویسندگان
چکیده
منابع مشابه
On solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملDimension of CPT posets
A containment model MP of a poset P = (X, ) maps every x ∈ X to a set Mx such that, for every distinct x, y ∈ X, x y if and only if Mx My . We shall be using the collection (Mx)x∈X to identify the containment model MP . A poset P = (X, ) is a Containment order of Paths in a Tree (CPT poset), if it admits a containment model MP = (Px)x∈X where every Px is a path of a tree T , which is called the...
متن کاملCohomological Dimension of Markov Compacta
We rephrase Gromov’s definition of Markov compacta, introduce a subclass of Markov compacta defined by one building block and study cohomological dimensions of these compacta. We show that for a Markov compactum X, dimZ(p) X = dimQ X for all but finitely many primes p where Z(p) is the localization of Z at p. We construct Markov compacta of arbitrarily large dimension having dimQ X = 1 as well ...
متن کاملProvability with finitely many variables
For every finite n ≥ 4 there is a logically valid sentence φn with the following properties: φn contains only 3 variables (each of which occurs many times); φn contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); φn has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n − 1 v...
متن کاملon solubility of groups with finitely many centralizers
for any group g, let c(g) denote the set of centralizers of g.we say that a group g has n centralizers (g is a cn-group) if |c(g)| = n.in this note, we prove that every finite cn-group with n ≤ 21 is soluble andthis estimate is sharp. moreover, we prove that every finite cn-group with|g| < 30n+1519 is non-nilpotent soluble. this result gives a partial answer to aconjecture raised by a. ashrafi in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1982
ISSN: 0021-8693
DOI: 10.1016/0021-8693(82)90260-5